Lattices with Many Cycles Are Dense
نویسنده
چکیده
We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Z/Λ has n− 1 cycles of equal length with arbitrary precision. We also show that a direct consequence of this is that the Shortest Vector Problem and the Closest Vector Problem cannot be easier for this type of lattices than for general lattices.
منابع مشابه
Algebraic Properties of Intuitionistic Fuzzy Residuated Lattices
In this paper, we investigate more relations between the symmetric residuated lattices $L$ with their corresponding intuitionistic fuzzy residuated lattice $tilde{L}$. It is shown that some algebraic structures of $L$ such as Heyting algebra, Glivenko residuated lattice and strict residuated lattice are preserved for $tilde{L}$. Examples are given for those structures that do not remain the sam...
متن کاملRegularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملRandom Ensembles of Lattices from Generalized Reductions
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower bound). Specializing to number field lattices, we obtain a number of interesting corollaries for i...
متن کاملThe Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Z/Λ. We give a proof that the shortest vector problem is NP-complete in the max-norm for n-dimensional lattices Λ where Z/Λ has n−1 cycles. We also give experimental data that show that the LLL algorithm does not perform significantly better on latti...
متن کاملAn equivalence functor between local vector lattices and vector lattices
We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...
متن کامل